integer sum

См. также в других словарях:

• Sum-product number — A sum product number is an integer that in a given base is equal to the sum of its digits times the product of its digits. Or, to put it algebraically, given an integer n that is l digits long in base b (with d x representing the x th digit), ifn …   Wikipedia

• Integer — This article is about the mathematical concept. For integers in computer science, see Integer (computer science). Symbol often used to denote the set of integers The integers (from the Latin integer, literally untouched , hence whole : the word… …   Wikipedia

• Sum addressed decoder — In CPU design, a Sum Addressed Decoder or Sum Addressed Memory (SAM) Decoder is a method of reducing the latency of the CPU cache access. This is achieved by fusing the address generation sum operation with the decode operation in the cache… …   Wikipedia

• Integer sequence — In mathematics, an integer sequence is a sequence (i.e., an ordered list) of integers. An integer sequence may be specified explicitly by giving a formula for its nth term, or implicitly by giving a relationship between its terms. For example,… …   Wikipedia

• Sum-free set — In additive combinatorics and number theory, a subset A of an abelian group G is said to be sum free if the sumset A⊕A is disjoint from A. In other words, A is sum free if the equation a + b = c has no solution with . For example, the set of odd… …   Wikipedia

• Sum-free sequence — In mathematics, a sum free sequence is an increasing positive integer sequence :{n k} {kinmathbb N} such that for each k, n k is never a sum of preceding elements of the same sequence. This definition is due to Paul Erdős, who was interested in… …   Wikipedia

• On-Line Encyclopedia of Integer Sequences — URL oeis.org Created by Neil Sloane Launched 1996 ( …   Wikipedia

• Proof that the sum of the reciprocals of the primes diverges — In the third century BC, Euclid proved the existence of infinitely many prime numbers. In the 18th century, Leonhard Euler proved a stronger statement: the sum of the reciprocals of all prime numbers diverges. Here, we present a number of proofs… …   Wikipedia

• Divergence of the sum of the reciprocals of the primes — The sum of the reciprocals of all prime numbers diverges, that is: This was proved by Leonhard Euler in 1737, and strengthens Euclid s 3rd century BC result that there are infinitely many prime numbers. There is a variety of proofs of Euler s… …   Wikipedia

• Digit sum — In mathematics, the digit sum of a given integer is the sum of all its digits, (e.g.: the digit sum of 84001 is calculated as 8+4+0+0+1 = 13). Digit sums are most often computed using the decimal representation of the given number, but… …   Wikipedia

• Ramanujan's sum — This article is not about Ramanujan summation. In number theory, a branch of mathematics, Ramanujan s sum, usually denoted c q ( n ), is a function of two positive integer variables q and n defined by the formula:c q(n)=sum {a=1atop… …   Wikipedia